Fuzzy Graph Coloring Technique to Classify the Accidental Zone of a Traffic Control

Let G= (V,E,σ,μ) be a simple connected undirected fuzzy graph. In this paper, we use a fuzzy graph model to represent a traffic network of a city and discuss a method to find the different type of accidental zones in a traffic flows. Depending on the possibility of accident, this paper classifies accidental zone of a traffic flow into three type’s namely α-strong, β-strong and δ-strong accidental zones. The advantage of this type of classifications is that it helps to minimize the accident. We also discuss two different approaches of fuzzy graph coloring for solving two major problems in traffic control. First approach is based on fuzzy coloring of fuzzy graphs and fuzziness of vertices. Using this approach, we can minimize the total waiting time of a traffic flow. It will help to reduce the traffic jam of a road. Second approach is based on the vertex coloring function of a fuzzy graph (crisp mode). The function is based on α cut of graph Gα=(Vα,Eα),the α cuts of fuzzy graph G. Here α value is used for aptitude level of the driver.